RECURSIVE TERNARY-BASED ALGORITHM FOR COMPUTING PRIME IMPLICANTS OF MULTI-OUTPUT BOOLEAN FUNCTIONS

The problem of computing the set prime implicants to represent a Boolean function is classical that still considered running for research because all known approaches have limitations. article reviews existing methods and highlights their limitations, particularly multi-output functions limited scalability due growth in memory required complete computation. Then it proposes recursive ternary-based minimization algorithm compute functions. based on concept Programmable Logic Array (PLA) tables, which provide structured efficient representation takes advantage ternary logic system efficiently while maintaining large complex functions, has significant implications digital circuit design optimization.